Interpretability degrees of finitely axiomatized sequential theories
نویسندگان
چکیده
منابع مشابه
A note on the interpretability logic of finitely axiomatized theories
Ill [6] Albert Visser shows that ILP completely axiomatizes all schemata about provabihty and relative interpretability that are prov-able in finitely axiomatized theories. In this paper we introduce a system called ILP ~ that completely axiomatizes the arithmetically valid principles of provability in and interpretabihty over such theories. To prove the arith-metical completeness of ILP ~ we u...
متن کاملOn quantum field theories with finitely many degrees of freedom
The existence of inequivalent representations in quantum field theory with finitely many degrees of freedom is shown. Their properties are exemplified and analysed for concrete and simple models. In particular the relations to Bogoliubov–Valatin quasi-particles, to thermo field dynamics, and to q–deformed quantum theories are put foreward. The thermal properties of the non-trivial vacuum are gi...
متن کاملA Finitely Axiomatized Formalization of Predicate Calculus with Equality
We present a formalization of first-order predicate calculus with equality which, unlike traditional systems with axiom schemata or substitution rules, is finitely axiomatized in the sense that each step in a formal proof admits only finitely many choices. This formalization is primarily based on the inference rule of condensed detachment of C. A. Meredith. The usual primitive notions of free v...
متن کاملA Finitely Axiomatized Formalization of Predicate Calculus with Equality
We present a formalization of first-order predicate calculus with equality which, unlike traditional systems with axiom schemata or substitution rules, is finitely axiomatized in the sense that each step in a formal proof admits only finitely many choices. This formalization is primarily based on the inference rule of condensed detachment of C. A. Meredith. The usual primitive notions of free v...
متن کاملA Finitely Axiomatized Formalization of Predicate Calculus with Equality
We present a formalization of first-order predicate calculus with equality which, unlike traditional systems with axiom schemata or substitution rules, is finitely axiomatized in the sense that each step in a formal proof admits only finitely many choices. This formalization is primarily based on the inference rule of condensed detachment of C. A. Meredith. The usual primitive notions of free v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2013
ISSN: 0933-5846,1432-0665
DOI: 10.1007/s00153-013-0353-8